- complete monotonicity
- мат.полная монотонность
English-Russian scientific dictionary. 2008.
complete monotonicity
Смотреть что такое "complete monotonicity" в других словарях:
Instant-runoff voting — Example instant runoff voting ballot … Wikipedia
Galois connection — In mathematics, especially in order theory, a Galois connection is a particular correspondence between two partially ordered sets (posets). Galois connections generalize the correspondence between subgroups and subfields investigated in Galois… … Wikipedia
Arrow's impossibility theorem — In social choice theory, Arrow’s impossibility theorem, the General Possibility Theorem, or Arrow’s paradox, states that, when voters have three or more distinct alternatives (options), no voting system can convert the ranked preferences of… … Wikipedia
Issues affecting the Single Transferable Vote — Main article: Single Transferable Vote There are a number of complications and issues surrounding the application and use of the Single Transferable Vote that form the basis of discussions between its advocates and detractors. Contents 1… … Wikipedia
Comparison of instant runoff voting to other voting systems — This article is a comparison of various voting systems with Instant runoff voting (IRV), also called the Alternative Vote , preferential voting and ranked choice voting. Contents 1 Categories 2 Voting system criteria 3 Voting system results … Wikipedia
Dominated convergence theorem — In measure theory, Lebesgue s dominated convergence theorem provides sufficient conditions under which two limit processes commute, namely Lebesgue integration and almost everywhere convergence of a sequence of functions. The dominated… … Wikipedia
Measure (mathematics) — Informally, a measure has the property of being monotone in the sense that if A is a subset of B, the measure of A is less than or equal to the measure of B. Furthermore, the measure of the empty set is required to be 0. In mathematical analysis … Wikipedia
Limit-preserving function (order theory) — In the mathematical area of order theory, one often speaks about functions that preserve certain limits, i.e. certain suprema or infima. Roughly speaking, these functions map the supremum/infimum of a set to the supremum/infimum of the image of… … Wikipedia
Dominance-based Rough Set Approach — (DRSA) is an extension of rough set theory for Multi Criteria Decision Analysis (MCDA), introduced by Greco, Matarazzo and Słowiński Greco, S., Matarazzo, B., Słowiński, R.: Rough sets theory for multicriteria decision analysis. European Journal… … Wikipedia
Dominance-based rough set approach — (DRSA) is an extension of rough set theory for multi criteria decision analysis (MCDA), introduced by Greco, Matarazzo and Słowiński. [1][2][3] The main change comparing to the classical rough sets is the substitution of the indiscernibility… … Wikipedia
Lattice (order) — See also: Lattice (group) The name lattice is suggested by the form of the Hasse diagram depicting it. Shown here is the lattice of partitions of a four element set {1,2,3,4}, ordered by the relation is a refinement of . In mathematics, a… … Wikipedia
